/* 马路上的树 */
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;

int main(void)
{
	int length = 500;
	int regions = 3;

	int start[] = {150, 100, 470};
	int end[] = {300, 200, 471};

	vector<int> v1(length + 1, 1);
	for (int i = 0; i < sizeof(start) / sizeof(start[0]); i++)
	{
		generate(v1.begin() + start[i], v1.begin() + end[i] + 1, [](void) -> int {return 0;});
	}

	int left = count(v1.begin(), v1.end(), 1);

	cout<< left <<endl;
}
